Subexponential Algorithms for Class Group and Unit Computations
نویسندگان
چکیده
منابع مشابه
Subexponential Class Group Computation in Quadratic Orders (abstract)
In 1989, the first subexponential algorithm for computing the class group of an imaginary quadratic order was introduced by Hafner and McCurley. Their algorithm is based on an integer factorization algorithm due to Seysen, and is conditional on the truth of the Extended Riemann Hypothesis. Not long after, their result was generalized to arbitrary algebraic number fields by Buchmann. Efficient v...
متن کاملSubexponential parameterized algorithms Survey.dvi
We give a review of a series of techniques and results on the design of subexponential parameterized algorithms for graph problems. The design of such algorithms usually consists of two main steps: first find a branch(or tree-) decomposition of the input graph whose width is bounded by a sublinear function of the parameter and, second, use this decomposition to solve the problem in time that is...
متن کاملSubexponential Parameterized Algorithms
We present a series of techniques for the design of subexponential parameterized algorithms for graph problems. The design of such algorithms usually consists of two main steps: first find a branch(or tree-) decomposition of the input graph whose width is bounded by a sublinear function of the parameter and, second, use this decomposition to solve the problem in time that is single exponential ...
متن کاملSubexponential Algorithms for Partial Cover Problems
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) the maximum number of edges (or vertices) using a given number (k) of vertices, rather than covering all edges (or vertices). In general graphs, these problems are hard for parameterized complexity classes when paramet...
متن کاملRandomized Subexponential Algorithms for Infinite Games
The complexity of solving infinite games, including parity, mean payoff, and simple stochastic games, is an important open problem in verification, automata theory, and complexity theory. In this paper we develop an abstract setting for studying and solving such games, as well as related problems, based on function optimization over certain discrete structures. We introduce new classes of compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1997
ISSN: 0747-7171
DOI: 10.1006/jsco.1996.0143